| 1. | When the second machine is a batch machine and the other two are discrete machines , np - hardness of this problem is proved
证明?当第二台机器是批处理机、其馀两台机器是单机时，该问题是np困难的。 |
| 2. | In this paper , the computational complexity of the three - stage flow - shop with some batch machines to minimize the makespan is studied
摘要研究含有批处理机的三台机器流水作业加工总长问题的计算复杂性。 |
| 3. | Both the situation when batch machines have finite capacity and the situation when batch machines have infinite capacity are considered
不仅考虑了批处理机容量有限的情形，还考虑了批处理机容量无限的情形。 |
| 4. | So far , the computational complexity of the makespan of the three - stage flow - shop with some batch machines in all situations is completely solved
至此，含有批处理机的三台机器流水作业加工总长问题在所有情形下的计算复杂性得到了解决。 |
| 5. | The problem of scheduling jobs with non - identical sizes on parallel batching machines is considered ; the objective is to minimize the maximum completion time ( makespan )
摘要考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。 |
| 6. | This thesis contains three parts , the objective is to minimize the maximum lateness on batching machine . two variants are analyzed . in part one , some notion , definitions and basic background information - ts introduced
在实际生产中，存在大量成批加工的问题，即如何分批，以便使某一目标函数达到最优的问题，论文主要研究了目标为极小化最大延迟时间的分批排序问题。 |
| 7. | Some heuristics for the problems are present , and their performance guarantee is analyzed by the transform lemma . some present results are improved . in part three , the problem of scheduling n jobs on a single ' batching machine is addressed , and the jobs have release times and due dates
第三部分研究了单台批处理机器，工件的到达时间不同，以极小化最大延迟时间为目标的分批排序问题1 | r _ j , b | lmax ，论文提出了一些近似算法，给出该了问题相应的最差性能比界。 |
| 8. | In part two , the scheduling problems on uniformly related batch machines are firstly delivered . two kinds of problems are considered : minimize the makespan and minimize the maximum lateness . the relation between batch scheduling and classical scheduling is declared , then an interesting transform lemma is obtained
第二部分对于m台同类机，工件的到达时间相同的情况，提出了分批问题q | b | cmax的算法bls ，算法blpt以及根据mf算法改进的一些算法，然后，针对这些算法，给出了分批排序问题q | b | lmax的最坏性能比分析。 |
